Termination w.r.t. Q proof of TRS/Rubiobintrees.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

concat₂(leaf, Y) -> Y
concat₂(cons₂(U, V), Y) -> cons₂(U, concat₂(V, Y))
lessleaves₂(X, leaf) -> false
lessleaves₂(leaf, cons₂(W, Z)) -> true
lessleaves₂(cons₂(U, V), cons₂(W, Z)) -> lessleaves₂(concat₂(U, V), concat₂(W, Z))

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

concat₂(leaf, Y) -> Y
concat₂(cons₂(U, V), Y) -> cons₂(U, concat₂(V, Y))
lessleaves₂(X, leaf) -> false
lessleaves₂(leaf, cons₂(W, Z)) -> true
lessleaves₂(cons₂(U, V), cons₂(W, Z)) -> lessleaves₂(concat₂(U, V), concat₂(W, Z))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

LESSLEAVES₂(cons₂(U, V), cons₂(W, Z)) -> LESSLEAVES₂(concat₂(U, V), concat₂(W, Z))
LESSLEAVES₂(cons₂(U, V), cons₂(W, Z)) -> CONCAT₂(W, Z)
LESSLEAVES₂(cons₂(U, V), cons₂(W, Z)) -> CONCAT₂(U, V)
CONCAT₂(cons₂(U, V), Y) -> CONCAT₂(V, Y)

The TRS R consists of the following rules:

concat₂(leaf, Y) -> Y
concat₂(cons₂(U, V), Y) -> cons₂(U, concat₂(V, Y))
lessleaves₂(X, leaf) -> false
lessleaves₂(leaf, cons₂(W, Z)) -> true
lessleaves₂(cons₂(U, V), cons₂(W, Z)) -> lessleaves₂(concat₂(U, V), concat₂(W, Z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

LESSLEAVES₂(cons₂(U, V), cons₂(W, Z)) -> LESSLEAVES₂(concat₂(U, V), concat₂(W, Z))
LESSLEAVES₂(cons₂(U, V), cons₂(W, Z)) -> CONCAT₂(W, Z)
LESSLEAVES₂(cons₂(U, V), cons₂(W, Z)) -> CONCAT₂(U, V)
CONCAT₂(cons₂(U, V), Y) -> CONCAT₂(V, Y)

The TRS R consists of the following rules:

concat₂(leaf, Y) -> Y
concat₂(cons₂(U, V), Y) -> cons₂(U, concat₂(V, Y))
lessleaves₂(X, leaf) -> false
lessleaves₂(leaf, cons₂(W, Z)) -> true
lessleaves₂(cons₂(U, V), cons₂(W, Z)) -> lessleaves₂(concat₂(U, V), concat₂(W, Z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 2 SCCs with 2 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

CONCAT₂(cons₂(U, V), Y) -> CONCAT₂(V, Y)

The TRS R consists of the following rules:

concat₂(leaf, Y) -> Y
concat₂(cons₂(U, V), Y) -> cons₂(U, concat₂(V, Y))
lessleaves₂(X, leaf) -> false
lessleaves₂(leaf, cons₂(W, Z)) -> true
lessleaves₂(cons₂(U, V), cons₂(W, Z)) -> lessleaves₂(concat₂(U, V), concat₂(W, Z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

CONCAT₂(cons₂(U, V), Y) -> CONCAT₂(V, Y)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(CONCAT₂(x₁, x₂)) = x₁
POL(cons₂(x₁, x₂)) = 1 + x₂

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ PisEmptyProof

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

concat₂(leaf, Y) -> Y
concat₂(cons₂(U, V), Y) -> cons₂(U, concat₂(V, Y))
lessleaves₂(X, leaf) -> false
lessleaves₂(leaf, cons₂(W, Z)) -> true
lessleaves₂(cons₂(U, V), cons₂(W, Z)) -> lessleaves₂(concat₂(U, V), concat₂(W, Z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

LESSLEAVES₂(cons₂(U, V), cons₂(W, Z)) -> LESSLEAVES₂(concat₂(U, V), concat₂(W, Z))

The TRS R consists of the following rules:

concat₂(leaf, Y) -> Y
concat₂(cons₂(U, V), Y) -> cons₂(U, concat₂(V, Y))
lessleaves₂(X, leaf) -> false
lessleaves₂(leaf, cons₂(W, Z)) -> true
lessleaves₂(cons₂(U, V), cons₂(W, Z)) -> lessleaves₂(concat₂(U, V), concat₂(W, Z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

LESSLEAVES₂(cons₂(U, V), cons₂(W, Z)) -> LESSLEAVES₂(concat₂(U, V), concat₂(W, Z))

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(LESSLEAVES₂(x₁, x₂)) = x₂
POL(concat₂(x₁, x₂)) = x₁ + x₂
POL(cons₂(x₁, x₂)) = 1 + x₁ + x₂
POL(leaf) = 0

The following usable rules [14] were oriented:

concat₂(cons₂(U, V), Y) -> cons₂(U, concat₂(V, Y))
concat₂(leaf, Y) -> Y

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

concat₂(leaf, Y) -> Y
concat₂(cons₂(U, V), Y) -> cons₂(U, concat₂(V, Y))
lessleaves₂(X, leaf) -> false
lessleaves₂(leaf, cons₂(W, Z)) -> true
lessleaves₂(cons₂(U, V), cons₂(W, Z)) -> lessleaves₂(concat₂(U, V), concat₂(W, Z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.